IO vs OI in Higher-Order Recursion Schemes
نویسنده
چکیده
We propose a study of the modes of derivation of higher-order recursion schemes, proving that value trees obtained from schemes using innermost-outermost derivations (IO) are the same as those obtained using unrestricted derivations. Given that higher-order recursion schemes can be used as a model of functional programs, innermost-outermost derivations policy represents a theoretical view point of call by value evaluation strategy.
منابع مشابه
On the First-Order Equivalence of Call-by-Name and Call-by-Value
Within the framework of (first–order) recursive applicative program schemes we prove the parameter–passing mechanisms call–by– name and call–by–value to be of the same computational power, thus solving an open problem in the theory of functional programming. The equivalence proof is given constructively by a detour through flowchart program schemes which operate on pushdown stores. This result ...
متن کاملAnnotated Stack Trees
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification. We study Ground Annotated Stack Tree Rewrite Systems – a tree rewrite system where each node is labelled by the configuration of an annotated pushdown automaton. This allows the modelling of fork and join constructs ...
متن کاملA Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for trivial automata model checking of higher-order recursion schemes. To our knowledge, this is the first practical model checking algorithm for recursion schemes that runs in time linear in the size of the higher-order recu...
متن کاملConstructing Logic Programs with Higher-Order Predicates
This paper proposes a logic programming approach based on the application of a system of higher-order predicates put at disposal within ordinary logic programming languages such as prolog. These higher-order predicates parallel the higher-order functionals or combinators which form an established part of contemporary functional programming methodology. The suggested toolbox of higher-order pred...
متن کاملThe Power of Tree Series Transducers of Type I and II
The power of tree series transducers of type I and II is studied for IO as well as OI tree series substitution. More precisely, it is shown that the IO tree series transformations of type I (respectively, type II) are characterized by the composition of homomorphism top-down IO tree series transformations with bottom-up (respectively, linear bottom-up) IO tree series transformations. On the oth...
متن کامل